Gathering asynchronous oblivious mobile robots in a ring
نویسندگان
چکیده
منابع مشابه
Gathering Asynchronous Oblivious Mobile Robots in a Ring
We consider the problem of gathering identical, memoryless, mobile robots in one node of an anonymous unoriented ring. Robots start from different nodes of the ring. They operate in Look-Compute-Move cycles and have to end up in the same node. In one cycle, a robot takes a snapshot of the current configuration (Look), makes a decision to stay idle or to move to one of its adjacent nodes (Comput...
متن کاملGathering Non-oblivious Mobile Robots
We study the Gathering Problem, where we want to gather a set of n autonomous mobile robots at a point in the plane. This point is not fixed in advance. The robots are very weak, in the sense that they have no common coordinate system, no identities, no central coordination, no means of direct communication, and no synchronization. Each robot can only sense the positions of the other robots, pe...
متن کاملCrash tolerant gathering on grid by asynchronous oblivious robots
Consider a system of autonomous mobile robots initially randomly deployed on the nodes of an anonymous finite grid. A gathering algorithm is a sequence of moves to be executed independently by each robot so that all robots meet at a single node after finite time. The robots operate in Look-Compute-Move cycles. In each cycle, a robot takes a snapshot of the current configuration of the grid in t...
متن کاملGathering of Asynchronous Oblivious Robots with Limited Visibility
W e consid er a collection of rob ots wh ich are id entical (anonym ou s), h ave lim ited visib ility of th e environm ent, and no m em ory of th e p ast (ob liviou s); fu rth erm ore, th ey are totally asynch ronou s in th eir ac tions, com p u tations, and m ovem ents. W e sh ow th at, even in su ch a totally asynch ronou s setting , it is p ossib le for th e rob ots to g ath er in th e sam e...
متن کاملGathering Asynchronous Mobile Robots with Inaccurate Compasses
This paper considers a system of asynchronous autonomous mobile robots that can move freely in a two dimensional plane with no agreement on a common coordinate system. Startingfrom any initial configuration, the robots are required to eventually gather at a single point, notfixed in advance (gathering problem). Prior work has shown that gathering oblivious (i.e., stateless) robots cannot be ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.09.032